Maximally entangled fermions

Fermions play an essential role in many areas of quantum physics and it is desirable to understand the nature of entanglement within systems that consists of fermions. Whereas the issue of separability for bipartite fermions has extensively been studied in the present literature, this paper is concerned with maximally entangled fermions. A complete characterization of maximally entangled quasifree (gaussian) fermion states is given in terms of the covariance matrix. This result can be seen as a step towards distillation protocols for maximally entangled fermions.Comment: 13 pages, 1 figure, RevTex, minor errors are corrected, section "Conclusions" is adde

On the structure of Clifford quantum cellular automata

We study reversible quantum cellular automata with the restriction that these are also Clifford operations. This means that tensor products of Pauli operators (or discrete Weyl operators) are mapped to tensor products of Pauli operators. Therefore Clifford quantum cellular automata are induced by symplectic cellular automata in phase space. We characterize these symplectic cellular automata and find that all possible local rules must be, up to some global shift, reflection invariant with respect to the origin. In the one dimensional case we also find that every uniquely determined and translationally invariant stabilizer state can be prepared from a product state by a single Clifford cellular automaton timestep, thereby characterizing these class of stabilizer states, and we show that all 1D Clifford quantum cellular automata are generated by a few elementary operations. We also show that the correspondence between translationally invariant stabilizer states and translationally invariant Clifford operations holds for periodic boundary conditions.Comment: 28 pages, 2 figures, LaTe

The algebra of Grassmann canonical anti-commutation relations (GAR) and its applications to fermionic systems

We present an approach to a non-commutative-like phase space which allows to analyze quasi-free states on the CAR algebra in analogy to quasi-free states on the CCR algebra. The used mathematical tools are based on a new algebraic structure the "Grassmann algebra of canonical anti-commutation relations" (GAR algebra) which is given by the twisted tensor product of a Grassmann and a CAR algebra. As a new application, the corresponding theory provides an elegant tool for calculating the fidelity of two quasi-free fermionic states which is needed for the study of entanglement distillation within fermionic systems.Comment: 25 page

Barycentric decomposition of quantum measurements in finite dimensions

We analyze the convex structure of the set of positive operator valued measures (POVMs) representing quantum measurements on a given finite dimensional quantum system, with outcomes in a given locally compact Hausdorff space. The extreme points of the convex set are operator valued measures concentrated on a finite set of k \le d^2 points of the outcome space, d< \infty being the dimension of the Hilbert space. We prove that for second countable outcome spaces any POVM admits a Choquet representation as the barycenter of the set of extreme points with respect to a suitable probability measure. In the general case, Krein-Milman theorem is invoked to represent POVMs as barycenters of a certain set of POVMs concentrated on k \le d^2 points of the outcome space.Comment: !5 pages, no figure

Reexamination of Quantum Bit Commitment: the Possible and the Impossible

Bit commitment protocols whose security is based on the laws of quantum mechanics alone are generally held to be impossible. In this paper we give a strengthened and explicit proof of this result. We extend its scope to a much larger variety of protocols, which may have an arbitrary number of rounds, in which both classical and quantum information is exchanged, and which may include aborts and resets. Moreover, we do not consider the receiver to be bound to a fixed "honest" strategy, so that "anonymous state protocols", which were recently suggested as a possible way to beat the known no-go results are also covered. We show that any concealing protocol allows the sender to find a cheating strategy, which is universal in the sense that it works against any strategy of the receiver. Moreover, if the concealing property holds only approximately, the cheat goes undetected with a high probability, which we explicitly estimate. The proof uses an explicit formalization of general two party protocols, which is applicable to more general situations, and a new estimate about the continuity of the Stinespring dilation of a general quantum channel. The result also provides a natural characterization of protocols that fall outside the standard setting of unlimited available technology, and thus may allow secure bit commitment. We present a new such protocol whose security, perhaps surprisingly, relies on decoherence in the receiver's lab.Comment: v1: 26 pages, 4 eps figures. v2: 31 pages, 5 eps figures; replaced with published version; title changed to comply with puzzling Phys. Rev. regulations; impossibility proof extended to protocols with infinitely many rounds or a continuous communication tree; security proof of decoherence monster protocol expanded; presentation clarifie